Compositional Reenement of Interactive Systems
نویسنده
چکیده
We describe systems and their components by functional speciication techniques. We deene notions of interface and interaction reenement for interactive systems and their components. These notions of reenement allow one to change both the syntactic (the number of channels and sorts of messages at the channels) and the semantic interface (causality ow between messages and interaction granularity) of an interactive system component. We prove that these notions of reenement are compositional with respect to sequential and parallel composition of system components, communication feedback and recursive declarations of system components. According to these proofs reenements of networks can be accomplished in a modular way by reening their components. We generalize the notions of reenement to reening contexts. Finally full abstraction for speciications is deened and compositionality with respect to this abstraction is shown, too.
منابع مشابه
A Compositional Rule for Hardware Design Refinement
We present an approach to designing veriied digital systems by a sequence of small local reenements. Reenements in this approach are not limited to a library of predeened transformations for which theorems have been previously established. Rather, the approach relies on localizing the reenement steps in such a way that they can be veriied eeciently by model checking. Toward this end, a composit...
متن کاملThe Kiv - Approach to Software Veri cation ? Wolfgang
This paper presents a particular approach to the design and veriication of large sequential systems. It is based on structured algebraic speciications and stepwise reenement by program modules. The approach is implemented in Kiv (Karlsruhe Interactive Veriier), and supports the entire design process starting from formal speciications and ending with veriied code. Its main characteristics are a ...
متن کاملThe KIV-Approach to Software Verification
This paper presents a particular approach to the design and veriication of large sequential systems. It is based on structured algebraic speciications and stepwise reenement by program modules. The approach is implemented in Kiv (Karlsruhe Interactive Veriier), and supports the entire design process starting from formal speciications and ending with veriied code. Its main characteristics are a ...
متن کاملCompositional Testing Preorders for Probabilistic Processes
Transition systems are well-established as a semantic model for distributed systems. There are widely accepted preorders that serve as criteria for reenement of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic s...
متن کاملOn Using Temporal Logic for Refinement and Compositional Verification of Concurrent Systems
A simple and elegant formulation of compositional proof systems for concurrent programs results from a reenement of temporal logic semantics. The reened temporal language we propose is closed under w-stuttering and, thus, provides a fully abstract semantics with respect to some chosen observation level w. This avoids incorporating irrelevant detail in the temporal semantics of parallel programs...
متن کامل